Improving performance of network covert timing channel through Huffman coding
نویسندگان
چکیده
منابع مشابه
CoCo: Coding-Based Covert Timing Channels for Network Flows
In this paper, we propose CoCo, a novel framework for establishing covert timing channels. The CoCo covert channel modulates the covert message in the inter-packet delays of the network flows, while a coding algorithm is used to ensure the robustness of the covert message to different perturbations. The CoCo covert channel is adjustable: by adjusting certain parameters one can trade off differe...
متن کاملPerformance Analysis of Huffman Coding Algorithm
Huffman coding is such a widespread method for creating prefix-free codes. Huffman code is used as a synonym for prefix-free code even when such a code is not produced by Huffman's algorithm. Huffman coding is an efficient source coding algorithm for source symbols that are not equally probable. It yields the smallest possible number of code symbols per source symbol [7]. In this paper, the Los...
متن کاملCovert channel for improving VoIP security
In this paper a new way of exchanging information for Voice over Internet Protocol (VoIP) service is presented. With use of digital watermarking and steganography techniques we achieve a covert channel which can be used for different purposes e.g. to improve IP Telephony security or to alternate existing protocols like RTCP (Real-Time Control Protocol). Main advantage of this solution is that i...
متن کاملQuantum-inspired Huffman Coding
ABSTRACT Huffman Compression, also known as Huffman Coding, is one of many compression techniques in use today. The two important features of Huffman coding are instantaneousness that is the codes can be interpreted as soon as they are received and variable length that is a most frequent symbol has length smaller than a less frequent symbol. The traditional Huffman coding has two procedures: co...
متن کاملGreedy Algorithms: Huffman Coding
Greedy Algorithms: In an optimization problem, we are given an input and asked to compute a structure, subject to various constraints, in a manner that either minimizes cost or maximizes profit. Such problems arise in many applications of science and engineering. Given an optimization problem, we are often faced with the question of whether the problem can be solved efficiently (as opposed to a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2012
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2011.01.051